Transport Properties of Random Walks on Scale-Free/Regular-Lattice Hybrid Networks
نویسندگان
چکیده
We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds (F ) and across network shortcuts (f ). For fast shortcuts (f/F 1) and low shortcut densities, traversal time data collapse onto a universal curve, while a crossover behavior that can be related to the percolation threshold of the scale-free network component is identified at higher shortcut densities, in analogy to similar observations reported recently in Newman-Watts small-world networks. Furthermore, we observe that random walk traversal times are larger for networks with a higher degree of inhomogeneity in their shortcut distribution, and we discuss access time distributions as functions of the initial and final node degrees. These findings are relevant, in particular, when considering the optimization of existing information networks by the addition of a small number of fast shortcut connections.
منابع مشابه
Random walks on the Apollonian network with a single trap
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node with the highest degree), which are simultaneously scale-free and small-world. We obtain the precise analytic expression for the MFPT that is confirmed by dir...
متن کاملSmall worlds, mazes and random walks
– A parametrized family of random walks whose trajectories are easily identified as graphs is presented. This construction shows small-world–like behavior but, interestingly, a power law emerges between the minimal distance L and the number of nodes N of the graph instead of the typical logarithmic scaling. We explain this peculiar finding in the light of the well-known scaling relationships in...
متن کاملSpectral dimensions of hierarchical scale-free networks with weighted shortcuts.
Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfra...
متن کاملRandom walks in modular scale-free networks with multiple traps.
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure and it is thus of great importance to uncover the effects of these two striking properties on various dynamical processes occurring on such networks. In this paper, we examine two cases of random walks performed on a class of modular scale-free networks with multip...
متن کاملDistinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence.
In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the behavior of trapping problems on scale-free networks, which is an integral major theme of interest for random walks in the presence of an immobile perfect abso...
متن کامل